Adaptive morphology shortest path planning based on rotating object and critical transition point
نویسندگان
چکیده
This paper presents a general approach to find the shortest path for a general moving object with rotation and forwardhackward movement among obstacles of ahitrary shapes. We call the object of finding a shortest path as path planning. By utilizing the cmcept of the critical transition point and adaptive path planning, finding a shortest path problem of car-like vehlcles becomes more practical. Moreover, additional efficiency in routing can be db tained since the critical transition point is used in the confguration space. Notice that the computatioml complexity is not ncreased. A car-like vehicle model with forwardhackward driving and turning mechanism is used to validate the performance of the proposed algorithms. Simulation results show that not only the proposed algorithms are successful in various environments, but also these algorithms have good efficiency in computation. Moreover, routing is gained by the help of morphological hory.
منابع مشابه
Planning and Control of Two-Link Rigid Flexible Manipulators in Dynamic Object Manipulation Missions
This research focuses on proposing an optimal trajectory planning and control method of two link rigid-flexible manipulators (TLRFM) for Dynamic Object Manipulation (DOM) missions. For the first time, achievement of DOM task using a rotating one flexible link robot was taken into account in [20]. The authors do not aim to contribute on either trajectory tracking or vibration control of the End-...
متن کاملOptimizing Mathematical Morphology for Image Segmentation and Vision-based Path Planning in Robotic Environments
Robotics advances have generated an increasing interest in new research projects and developments. Nowadays this science has several new applications characterized by working in non-structured dynamic environments. As a result, the research on this emerging area is growing, and, specially, vision algorithms are constantly being improved. In many cases, navigation needs real-time answers. As rob...
متن کاملA shortest path algorithm for a nonrotating object among obstacles of arbitrary shapes
A shortest path algorithm for motion planning problem via mathematical morphology is proposed. The moving object and obstacles can be of arbitrary shapes of finite size. To speed up the computation of the free positions of a moving object, the idea of shape decomposition is developed. It is proven that the decomposition always reduces the number of iterations. In addition, a simple geometric al...
متن کاملPoint Cloud Simplification and Processing for Path-Planning
Recently the area of motion planning research has been experiencing a significant resurgence of interest based on hybrid working environments that combine point and CAD models. Companies are able to work with point clouds and perform certain operations, such as path-planning, but they lack the support for fast shortest-distance computations for point clouds with more than tens of millions of po...
متن کاملPath Planning for Aircraft Fuel Tank Inspection Robot Based on Region Division
Path planning is indispensable in performing the inspection task using continuum robot in the environment like aircraft fuel tank. In order to obtain the optimal path and make it feasible for the robot traversal, a path planning strategy based on region division is put forward. The aircraft fuel tank is divided into several regions and mapped to a two-dimension plane by using dimension reductio...
متن کامل